Numerical Optimization

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Optimization with Neuroevolution

Neuroevolution techniques have been successful in many sequential decision tasks such as robot control and game playing. This paper aims at establishing whether they can be useful in numerical optimization more generally, by comparing neuroevolution to linear programming in a manufacturing optimization domain. It turns out that neuroevolution can learn to compensate for uncertainty in the data ...

متن کامل

Spider Monkey Optimization algorithm for numerical optimization

Swarm intelligence is a fascinating area for the researchers in the field of optimization. Researchers have developed many algorithms by simulating the swarming behavior of various creatures like ants, honey bees, fishes, birds and their findings are very motivating. In this paper, a new approach for optimization is proposed by modeling the social behavior of spider monkeys. Spider monkeys have...

متن کامل

Taguchi-Particle Swarm Optimization for Numerical Optimization

In this work, a hybrid Taguchi-Particle Swarm Optimization (TPSO) is proposed to solve global numerical optimization problems with continuous and discrete variables. This hybrid algorithm combines the well-known Particle Swarm Optimization Algorithm with the established Taguchi method, which has been an important tool for robust design. This paper presents the improvements obtained despite the ...

متن کامل

Positive Bases in Numerical Optimization

The theory of positive bases introduced by C. Davis in 1954 does not appear in most modern texts on linear algebra but has re-emerged in publications in optimization journals. In this paper some simple properties of this highly useful theory are highlighted and applied to both theoretical and practical aspects of the design and implementation of numerical algorithms for nonlinear optimization.

متن کامل

Numerical Functional Analysis and Optimization

In signal processing, discrete convolutions are usually involved in fast calculating coefficients of time-frequency decompositions like wavelet and Gabor frames. Depending on the regularity of the mother analyzing functions, one wants to detect the right resolution in order to achieve good approximations of coefficients. Local–global conditions on functions in order to get the convergence rate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operational Research Society

سال: 2001

ISSN: 0160-5682,1476-9360

DOI: 10.1057/palgrave.jors.2601183